Size, constant sequences, and optimal selection

Size, constant sequences, and optimal selection.

Because the abundance of functional molecules in RNA sequence space has many unexplored aspects, we compared the outcome of 11 independent selections, performed using the same affinity selection protocol and contiguous randomized regions of 16, 22, 26, 50, 70, and 90 nucleotides. All affinity selections targeted the simplest isoleucine aptamer, an asymmetric internal loop. This loop should be a...

Analytical Bounds for Optimal Tile Size Selection

In this paper, we introduce a novel approach to guide tile size selection by employing analytical models to limit empirical search within a subspace of the full search space. Two analytical models are used together: 1) an existing conservative model, based on the data footprint of a tile, which ignores intra-tile cache block replacement, and 2) an aggressive new model that assumes optimal cache...

Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes

An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...

Viewpoint Selection - Planning Optimal Sequences of Views for Object Recognition

In the past decades most object recognition systems were based on passive approaches. But in the last few years a lot of research was done in the field of active object recognition. In this context there are several unique problems to be solved, like the fusion of several views and the selection of the best next viewpoint. In this paper we present an approach to solve the problem of choosing op...

Throughput Optimal Packet Size Selection (TOPS) for Bluetooth Networks